Operational/Interpretive Unfolding of Multi-adjoint Logic Programs

نویسندگان

  • Pascual Julián Iranzo
  • Ginés Moreno
  • Jaime Penabad
چکیده

Multi-adjoint logic programming represents a very recent, extremely flexible attempt for introducing fuzzy logic into logic programming. In this setting, the execution of a goal w.r.t. a given program is done in two separate phases. During the operational one, admissible steps are systematically applied in a similar way to classical resolution steps in pure logic programming, thus returning a computed substitution together with an expression where all atoms have been exploited. This last expression is then interpreted under a given lattice during the so called interpretive phase, hence returning a value which represents the fuzzy component (truth degree) of the computed

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On fuzzy unfolding: A multi-adjoint approach

Pascual Juli an a Gin es Moreno b Jaime Penabad c aDepartment of Computer Science ESI, Univ. of Castilla{La Mancha Paseo de la Universidad, 4; 13071 Ciudad Real, Spain bDepartment of Computer Science cDepartment of Mathematics EPSA, Univ. of Castilla{La Mancha Campus Universitario, s/n; 02071 Albacete, Spain Abstract In the context of (fuzzy) logic programs, `unfolding' means to transform a pro...

متن کامل

Building a Fuzzy Transformation System

Multi-adjoint logic programming represents a very recent, extremely exible attempt for introducing fuzzy logic into logic programming. Inspired by previous approaches largely used in other (crisp) declarative paradigms, in this paper we propose the development of a fold/unfold based transformation system for optimizing such kind of fuzzy logic programs. We prove that our set of transformation r...

متن کامل

The Unfolding Semantics of Functional Programs

The idea of using unfolding as a way of computing a program semantics has been applied successfully to logic programs and has shown itself a powerful tool that provides concrete, implementable results, as its outcome is actually source code. Thus, it can be used for characterizing not-so-declarative constructs inmostly declarative languages, or for static analysis. However, unfolding-based sema...

متن کامل

Biresiduated Multi-Adjoint Logic Programming

Multi-adjoint logic programs were recently proposed as a generalisation of monotonic and residuated logic programs introduced, in that simultaneous use of several implications in the rules and rather general connectives in the bodies are allowed. In this work, the possible existence of biresiduated pairs is considered, later, on the resulting framework of biresiduated multi-adjoint logic progra...

متن کامل

Learning of Constraint Logic Programs by Combining Unfolding and Slicing Techniques

This paper discusses learning of Constraint Logic Programs using unfolding and slicing technique. The transformation rule for unfolding together with clause removal is a method for specialization of Logic Programs. Slicing is a program analysis technique originally developed for imperative languages. It facilitates the understanding of data flow and debugging. This paper formulates the semantic...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • J. UCS

دوره 12  شماره 

صفحات  -

تاریخ انتشار 2006